Generalise Projections for Strictness Analysis ( Extended
نویسنده
چکیده
We show how Wadler and Hughes's use of Scott projections to describe properties of functions (\Projections for Strictness Analysis", FPCA 1987) can be generalised by the use of partial equivalence relations. We describe an analysis (in the form of an abstract interpretation) for identifying such properties for functions deened in the simply typed-calculus. Our analysis has a very simple proof of correctness, based on the use of logical relations. We go on to consider how to derivèbest' correct interpretations for constants.
منابع مشابه
Compiling Laziness Using Projection Types
Strictness analysis is accepted as an important tool for the eecient implementation of lazy functional languages. However, the analyses are usually rst-order and the optimisations that follow may be ad hoc. Using projections to represent static properties of programs is appealing because they naturally describe component-wise demand on data structures and can handle latent demands such as head-...
متن کاملAnalysing Functions by Projection-Based Backward Abstraction
Various techniques for strictness analysis by non-standard interpretation have been proposed in which the basic non-standard values are projections. We show that continuous functions can be completely characterised by appropriate forward and backward abstractions.
متن کاملProjections for Polymorphic First-Order Strictness Analysis
We apply the categorical properties of polymorphic functions to compile-time analysis, speciically projection-based strictness analysis. First we interpret parameterised types as functors in a suitable category, and show that they preserve monics and epics. Then we deene \strong" and \weak" polymorphism, the latter admitting certain projections that are not polymorphic in the usual sense. We pr...
متن کاملA New Technique for Strictness Analysis
Results from Unification Theory and type inference with coercions are combined to produce a new method for performing strictness analysis of functional programs. A formal deduction system is developed in which extended types are derivable for terms of the A-calculus. These extended types contain Boolean rings describing the reduction behaviour of terms. Algorithms implementing the method are de...
متن کاملLevel of Grammatical Proficiency and Acquisition of Functional Projections: The case of Iranian learners of English language
Unlike Lexical Projections, Functional Projections (Extended Projections) are more of an ‘abstract’ in nature. Therefore, Functional Projections seem to be acquired later than Lexical Projections by the L2 learners. The present study investigates Iranian L2 learners’ acquisition of English Extended Projections taking into account their level of grammatical proficiency. Specifically, the aim is ...
متن کامل